A Distributed K-Mutual Exclusion Algorithm
نویسندگان
چکیده
This report presents a token-based K-mutual exclusion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token requests. The algorithm is designed to minimize the number of messages and also the delay in entering the critical section, at low as well as high loads. The report presents simulation results for the proposed algorithm and compares them with three other algorithms. Unlike previous work, our simulation model assumes that a nite (non-zero) overhead is encountered when a message is sent or received. The simulation results show that, as compared to other algorithms, the proposed algorithm achieves lower delay in entering critical section as well as lower number of messages, without a serious increase in the size of the messages. This report is an abbreviated version of 1] y Direct all correspondence to Nitin Vaidya.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملA Study on the Distributed k-Mutual Exclusion Problem
The distributed k-mutual exclusion problem is the problem of guaranteeing that at most k processes can enter a critical section at a time in a distributed system. The distributed 1-mutual exclusion problem is one of fundamental distributed problems in distributed systems and many algorithms for solving the problem have been proposed. In this paper, we introduce the k-coterie as an extension of ...
متن کاملA Quorum Based (m, h, k)-Resource Allocation Algorithm
In this paper, we present a quorum based algorithm for (m,h, k)-resource allocation problem, i.e., a conflict resolution problem to control a distributed system consisting of n users and m critical resources so that the following two requirements are satisfied: at any given time, at most h (out of m) resources can be utilized by some users simultaneously and each resource is utilized by at most...
متن کاملAn Efficient K-Mutual Exclusion Algorithm Using a New Token Passing Strategy
This paper addresses the issue of K-mutual exclusion in a distributed system. Our proposed algorithm divides a network into root nodes and regular nodes. The root nodes communicate with each other via a ring network and communicate directly with a set of regular nodes that they are assigned to. Mutual exclusion is achieved by using k tokens that are maintained by the root nodes, the collaborati...
متن کاملA Distributed k-Mutual Exclusion Algorithm Using k-Coterie
The concept of k-coterie is introduced and a distributed k-mutual exclusion algorithm is proposed using it. A k-coterie is a natural extension of a coterie. The message complexity of the algorithm is O(c) when conflicts with other processes in capturing a quorum do not occur, where c is the maximum quorum size of the k-coterie the algorithm uses.
متن کاملExclusion and Object Tracking in a Network of Processes
This paper concerns two fundamental problems in distributed computing—mutual exclusion and mobile object tracking. For a variant of the mutual exclusion problem where the network topology is taken into account, all existing distributed solutions make use of tokens. It turns out that these token-based solutions for mutual exclusion can also be adapted for object tracking, as the token behaves ve...
متن کامل